Globally convergent algorithms for finding zeros of duplomonotone mappings

نویسندگان

  • Francisco J. Aragón Artacho
  • Ronan M. T. Fleming
چکیده

We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class ofmonotonemappings.We study some of themain properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally,we present three variations of a derivative-free line search algorithm for finding zeros of systems of duplomonotone equations, and we prove their linear convergence to a zero of the function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Globally convergent algorithms for nding zeros of duplomonotone mappings

We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class of monotone mappings. We study some of the main properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally, we present three variations of a derivative-free line search algori...

متن کامل

Solving Variational Inequalities Involving Nonexpansive Type Mappings

The purpose of this paper is to investigate the asymptotic behavior of algorithms for finding solutions for a certain class of variational inequalities V ID(C, I−f) involving nonexpansive type mappings in smooth Banach spaces. We study existence of solutions of variational inequalities V ID(C, I− f) when D is the set of solutions of zeros of accretive operators or the set of fixed points of non...

متن کامل

Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing glo...

متن کامل

A Third Order Iterative Method for Finding Zeros of Nonlinear Equations

‎In this paper‎, ‎we present a new modification of Newton's method‎ ‎for finding a simple root of a nonlinear equation‎. ‎It has been‎ ‎proved that the new method converges cubically‎.

متن کامل

Strong Convergence Theorems for Nonexpansive Nonself-Mappings and Inverse-Strongly-Monotone Mappings

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive nonself-mapping and the set of solutions of the variational inequality for an inversestrongly-monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a commo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Letters

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2015